Cubic Curves, Finite Geometry and Cryptography

Some geometry on non-singular cubic curves, mainly over finite fields, is surveyed. Such a curve has 9,3,1 or 0 points of inflexion, and cubic curves are classified accordingly. The group structure and the possible numbers of rational points are also surveyed. A possible strengthening of the security of elliptic curve cryptography is proposed using a `shared secret' related to the group law. Cubic curves are also used in a new way to construct sets of points having various combinatorial and geometric properties that are of particular interest in finite Desarguesian planes.Comment: This is a version of our article to appear in Acta Applicandae Mathematicae. In this version, we have corrected a sentence in the third paragraph. The final publication is available at springerlink.com at http://www.springerlink.com/content/xh85647871215644

A Complete Characterization of Irreducible Cyclic Orbit Codes and their Pl\"ucker Embedding

Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a central topic in random linear network coding theory. Orbit codes represent a subclass of constant dimension codes. They are defined as orbits of a subgroup of the general linear group on the Grassmannian. This paper gives a complete characterization of orbit codes that are generated by an irreducible cyclic group, i.e. a group having one generator that has no non-trivial invariant subspace. We show how some of the basic properties of these codes, the cardinality and the minimum distance, can be derived using the isomorphism of the vector space and the extension field. Furthermore, we investigate the Pl\"ucker embedding of these codes and show how the orbit structure is preserved in the embedding.Comment: submitted to Designs, Codes and Cryptograph

On Invariant Notions of Segre Varieties in Binary Projective Spaces

Invariant notions of a class of Segre varieties \Segrem(2) of PG(2^m - 1, 2) that are direct products of $m$ copies of PG(1, 2), $m$ being any positive integer, are established and studied. We first demonstrate that there exists a hyperbolic quadric that contains \Segrem(2) and is invariant under its projective stabiliser group \Stab{m}{2}. By embedding PG(2^m - 1, 2) into \PG(2^m - 1, 4), a basis of the latter space is constructed that is invariant under \Stab{m}{2} as well. Such a basis can be split into two subsets whose spans are either real or complex-conjugate subspaces according as $m$ is even or odd. In the latter case, these spans can, in addition, be viewed as indicator sets of a \Stab{m}{2}-invariant geometric spread of lines of PG(2^m - 1, 2). This spread is also related with a \Stab{m}{2}-invariant non-singular Hermitian variety. The case $m=3$ is examined in detail to illustrate the theory. Here, the lines of the invariant spread are found to fall into four distinct orbits under \Stab{3}{2}, while the points of PG(7, 2) form five orbits.Comment: 18 pages, 1 figure; v2 - version accepted in Designs, Codes and Cryptograph

Families of twisted tensor product codes

Using geometric properties of the variety \cV_{r,t}, the image under the Grassmannian map of a Desarguesian $(t-1)$-spread of \PG(rt-1,q), we introduce error correcting codes related to the twisted tensor product construction, producing several families of constacyclic codes. We exactly determine the parameters of these codes and characterise the words of minimum weight.Comment: Keywords: Segre Product, Veronesean, Grassmannian, Desarguesian spread, Subgeometry, Twisted Product, Constacyclic error correcting code, Minimum weigh

Lines, Circles, Planes and Spheres

Let $S$ be a set of $n$ points in $\mathbb{R}^3$, no three collinear and not all coplanar. If at most $n-k$ are coplanar and $n$ is sufficiently large, the total number of planes determined is at least $1 + k \binom{n-k}{2}-\binom{k}{2}(\frac{n-k}{2})$. For similar conditions and sufficiently large $n$, (inspired by the work of P. D. T. A. Elliott in \cite{Ell67}) we also show that the number of spheres determined by $n$ points is at least $1+\binom{n-1}{3}-t_3^{orchard}(n-1)$, and this bound is best possible under its hypothesis. (By $t_3^{orchard}(n)$, we are denoting the maximum number of three-point lines attainable by a configuration of $n$ points, no four collinear, in the plane, i.e., the classic Orchard Problem.) New lower bounds are also given for both lines and circles.Comment: 37 page

A Survey of Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements

The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are discussed and an emerging link between them is outlined. It is shown that these methods employ a wide range of important mathematical concepts like, e.g., Fourier transforms, Galois fields and rings, finite and related projective geometries, and entanglement, to mention a few. Some applications of the theory to quantum information tasks are also mentioned.Comment: 20 pages, 1 figure to appear in Foundations of Physics, Nov. 2006 two more references adde